/*
 * Copyright (c) 2017 Andrea Giacomo Baldan
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to
 * deal in the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.  Copyright (c) 2016-2017 Andrea Giacomo Baldan
 */

#ifndef LIST_H
#define LIST_H


struct _list_node {
    void *data;
    struct _list_node *next;
};


typedef struct _list_node list_node;


typedef struct {
    list_node *head;
    list_node *tail;
    unsigned long len;
} list;


list *list_create(void);
list *list_attach(list *, list_node *, unsigned long);
void list_release(list *);
list *list_head_insert(list *, void *);
list *list_tail_insert(list *, void *);
list_node *merge_sort(list_node *);

#endif
